Hamiltonicity of the Cayley Digraph On
نویسنده
چکیده
The symmetric group is generated by σ = (1 2 ··· n) and τ = (1 2). We answer an open problem of Nijenhuis and Wilf by constructing a Hamilton path in the directed Cayley graph for all n, and a Hamilton cycle for odd n. Dedicated to Herb Wilf (1931 – 2012).
منابع مشابه
On endo-Cayley digraphs: The hamiltonian property
Given a finite abelian group A, a subset ⊆ A and an endomorphism of A, the endo-Cayley digraph GA( , ) is defined by taking A as the vertex set and making every vertex x adjacent to the vertices (x)+ a with a ∈ . When A is cyclic and the set is of the form = {e, e + h, . . . , e + (d − 1)h}, the digraph G is called a consecutive digraph. In this paper we study the hamiltonicity of endo-Cayley d...
متن کاملCycles in the cycle prefix digraph
Cycle prefix digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry, large number of nodes for a given degree and diameter, simple shortest path routing, Hamiltonicity, optimal connectivity, and others. In this paper we show that the cycle prefix digraphs, like the Kautz digraphs, contain cycles of all lengths l, with l between two and N , the order of the ...
متن کاملQuasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian
We introduce new necessary conditions, k-quasi-hamiltonicity (0 k n ? 1), for a digraph of order n to be hamiltonian. Every (k + 1)-quasi-hamiltonian digraph is also k-quasi-hamiltonian; we construct digraphs which are k-quasi-hamiltonian, but not (k + 1)-quasi-hamiltonian. We design an algorithm that checks k-quasi-hamiltonicity of a given digraph with n vertices and m arcs in time O(nm k). We...
متن کاملThe Spectra of Manhattan Street Networks
The multidimensional Manhattan street networks constitute a family of digraphs with many interesting properties, such as vertex symmetry (in fact they are Cayley digraphs), easy routing, Hamiltonicity, and modular structure. From the known structural properties of these digraphs, we determine their spectra, which always contain the spectra of hypercubes. In particular, in the standard (two-dime...
متن کاملComparing a Cayley Digraph with Its Reverse
A Cayley digraph G = C(Γ, X) for a group Γ and a generating set X is the digraph with vertex set V (G) = Γ and arcs (g, gx) where g ∈ Γ and x ∈ X. The reverse of C(Γ, X) is the Cayley digraph G−1 = C(Γ, X−1) where X−1 = {x−1;x ∈ X}. We are interested in sufficient conditions for a Cayley digraph not to be isomorphic to its reverse and focus on Cayley digraphs of metacyclic groups with small gen...
متن کامل